Best Approximate Quantum Compiling Problems
نویسندگان
چکیده
We study the problem of finding best approximate circuit that is closest (in some pertinent metric) to a target circuit, and which satisfies number hardware constraints, like gate alphabet connectivity. look at in CNOT+rotation set from mathematical programming standpoint, offering contributions both terms understanding mathematics its efficient solution. Among results we present, are able derive 14-CNOT 4-qubit Toffoli decomposition scratch, show Quantum Shannon Decomposition can be compressed by factor two without practical loss fidelity.
منابع مشابه
Compiling planning into quantum optimization problems: a comparative study
One approach to solving planning problems is to compile them to another problem for which powerful off-the-shelf solvers are available; common targets include SAT, CSP, and MILP. Recently, a novel optimization technique has become available: quantum annealing (QA). QA takes as input problem instances encoded as Quadratic Unconstrained Binary Optimization (QUBO). Early quantum annealers are now ...
متن کاملCompiling constraint satisfaction problems
Many tasks requiring intelligence, in particular scheduling and planning, must be solved under time constraints. This is diicult to achieve because of the combinato-rial nature of such tasks. While search heuristics can give good average performance, they cannot give any peformance guarantees for a particular instance. Fortunately, the tasks are often very similar. Therefore, compiling partial ...
متن کاملTopological quantum compiling
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids three-braids . These three-braids can...
متن کاملAsymptotically Optimal Topological Quantum Compiling
We address the problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model. We classify the single-qubit unitaries that can be represented exactly by Fibonacci anyon braids and use the classification to develop a probabilistically polynomial algorithm that approximates any given single-qubit unitary to a desired precis...
متن کاملNew methods for Quantum Compiling
The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum computers. In my work I focus on the new methods for compiling single qubit operations that appear in many quantum algorithms into single qubit operations natively supported by sev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM transactions on quantum computing
سال: 2022
ISSN: ['2643-6817', '2643-6809']
DOI: https://doi.org/10.1145/3505181